A general complex eigen-problem solver based on Lanczos algorithm and inverse iteration

نویسنده

  • Michael Christensen
چکیده

A method for solving the eigen-problem of a general complex matrix can be constructed by first using a simple double-sided Lanczos algorithm to obtain the eigenvalues and next applying inverse iteration to find the eigenvectors. Even though (strict) convergence is not generally guaranteed, many well-posed physical and chemical problems can be transformed into eigen-problems of non-pathological matrices for which the method presented here works perfectly well. ∗MagniComp version, email: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multilevel Algorithm for Spectral Partitioning with Extended Eigen-Models

Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph partitioning problem. In this paper, a new subspace algorithm for the solving the extended eigenproblem is presented. The structure of this subspace method allows the incorporation of multigrid preconditioners. We num...

متن کامل

An effective method for eigen-problem solution of fluid-structure systems

Efficient mode shape extraction of fluid-structure systems is of particular interest in engineering. An efficient modified version of unsymmetric Lanczos method is proposed in this paper. The original unsymmetric Lanczos method was applied to general form of unsymmetric matrices, while the proposed method is developed particularly for the fluid-structure matrices. The method provides us with si...

متن کامل

Superlinear Convergence Rates for the Lanczos Method Applied to Elliptic Operators

This paper investigates the convergence of the Lanczos method for computing the smallest eigenpair of a selfadjoint elliptic diierential operator via inverse iteration (without shifts). Superlinear convergence rates are established, and their sharpness is investigated for a simple model problem. These results are illustrated numerically for a more diicult problem.

متن کامل

A Robust and Efficient Parallel SVD Solver Based on Restarted Lanczos Bidiagonalization

Lanczos bidiagonalization is a competitive method for computing a partial singular value decomposition of a large sparse matrix, that is, when only a subset of the singular values and corresponding singular vectors are required. However, a straightforward implementation of the algorithm has the problem of loss of orthogonality between computed Lanczos vectors, and some reorthogonalization techn...

متن کامل

COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERINGCommun

SUMMARY The computation of a few smallest eigenvalues of generalized algebraic eigenvalue problems is studied. The considered problems are obtained by discretizing self-adjoint second-order elliptic partial diierential eigenvalue problems in two-dimensional or three-dimensional domains. The standard Lanczos algorithm with the complete orthogonalization is used to compute some eigenvalues of the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001